On Random Number Generation for Kernel Applications

An operating system kernel uses cryptographically secure pseudorandom number generator (CSPRNG) for creating address space layout randomization (ASLR) offsets to protect memory addresses of processes from exploitation, storing users’ passwords securely and cryptographic keys. However, at present, popular CSPRNGs such as Yarrow, Fortuna /dev/(u)random which are used by MacOS/iOS/FreeBSD, Windows Linux/Android kernels respectively lack the very crucial property non-reproducibility their generated bitstreams is nullify scope predicting bitstream. This paper proposes a CSPRNG called Cryptographically Secure Pseudorandom Number Generator Kernel Applications (KCS-PRNG) generates non-reproducible bitstreams. The proposed KCS-PRNG presents an efficient design uniquely configured with two new non-standard verified elliptic curves clock-controlled Linear Feedback Shift Registers (LFSRs) novel method consistently generate random arbitrary lengths. statistically indistinguishable true provably secure, resilient important attacks, exhibits backward forward secrecy, exponential linear complexity, large period huge key space.